cases = int(input())
for i in range(cases):
voters = int(input())
review = list(map(int, input().split()))
count = 0
for j in range(len(review)):
if review[j] == 1 or review[j] == 3:
count += 1
print(count)#include <iostream>
#include <map>
//#include <bits/stdc++.h>
using namespace std;
#define ll long long
int main(int argc, char *argv[])
{
ll t,n,x;
char c;
cin>>t;
while(t--)
{
cin>>n;
x=0;
// ll *a=new ll[n];
while(n--)
{
cin>>c;
if(c=='1' || c=='3')
//cout<<"Nop"<<endl;
x++;
}
/* sort(a,a+n);
for(ll i=0;i<n;i++)
if(b[i]==a[n-1])
cout<<b[i]-a[n-2]<<' ';
else
cout<<b[i]-a[n-1]<<' ';*/
cout<<x<<endl;
}
}938. Range Sum of BST | 147. Insertion Sort List |
310. Minimum Height Trees | 2110. Number of Smooth Descent Periods of a Stock |
2109. Adding Spaces to a String | 2108. Find First Palindromic String in the Array |
394. Decode String | 902. Numbers At Most N Given Digit Set |
221. Maximal Square | 1200. Minimum Absolute Difference |
1619B - Squares and Cubes | 1619A - Square String |
1629B - GCD Arrays | 1629A - Download More RAM |
1629C - Meximum Array | 1629D - Peculiar Movie Preferences |
1629E - Grid Xor | 1629F1 - Game on Sum (Easy Version) |
2148. Count Elements With Strictly Smaller and Greater Elements | 2149. Rearrange Array Elements by Sign |
2150. Find All Lonely Numbers in the Array | 2151. Maximum Good People Based on Statements |
2144. Minimum Cost of Buying Candies With Discount | Non empty subsets |
1630A - And Matching | 1630B - Range and Partition |
1630C - Paint the Middle | 1630D - Flipping Range |
1328A - Divisibility Problem | 339A - Helpful Maths |